Sharing the Garden GATE: Towards an Efficient Uniform Programming Model for CLUMPS

نویسندگان

  • Darren Butler
  • Paul Roe
چکیده

Gardens integrates a programming language and system to support parallel computation over a network of workstations. Our goal is to develop extensions to Gardens allowing it to efficiently support clusters of SMP machines under a uniform programming model. Such support requires the implementation of high-performance shared memory message passing primitives as well as changes to the existing model invariants and the Gardens runtime system itself. The new communication primitives have demonstrated a minimum latency of 2.0 microseconds and can maintain a maximum bandwidth of approximately 194 MB/s on our test system. The NAS benchmarks, EP and CG have also demonstrated significant performance increases when parallelised by Gardens. The major contribution of this work is a system that efficiently supports multiprocessor computers in a network of workstations with a uniform programming model. Such a system promises to greatly simplify the task of developing high-performance parallel applications to run on

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The patterns and behaviors of researchers’ knowledge sharing in scientific social networks:A Case Study of Research Gate’ Question And Answer System

Aim: Scientific social networks were shaped as part of a set of social software and a platform for international interactions sharing the tangible and intangible knowledge of researchers. The purpose is to investigate the patterns and behaviors of knowledge sharing of researchers in Research Gate. Based on this, the question and answer system of this scientific social network was analyzed and r...

متن کامل

ALTERNATIVE MIXED INTEGER PROGRAMMING FOR FINDING EFFICIENT BCC UNIT

Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...

متن کامل

An efficient modified neural network for solving nonlinear programming problems with hybrid constraints

This paper presents ‎‎the optimization techniques for solving‎‎ convex programming problems with hybrid constraints‎.‎ According to the saddle point theorem‎, ‎optimization theory‎, ‎convex analysis theory‎, ‎Lyapunov stability theory and LaSalle‎‎invariance principle‎,‎ a neural network model is constructed‎.‎ The equilibrium point of the proposed model is proved to be equivalent to the optima...

متن کامل

A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

متن کامل

Electric-vehicle car-sharing in one-way car-sharing systems considering depreciation costs of vehicles and chargers

In recent years, car-sharing systems have been announced as a way to increase mobility and to decrease the number of single-occupant vehicles, congestion, and air pollution in many parts of the world. This study presents a linear programming model to optimize one-way car-sharing systems for electric cars considering the depreciation costs of chargers and vehicles as well as relocation cost of v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999